for i in range(int(input())):
a ,b = map(int , input().split())
s = (input())
ind = []
for j in range(len(s)):
if s[j]=="1":
ind.append(j+1)
var = []
for j in range(len(ind)-1):
if ind[j+1]-ind[j]!=1:
var.append(ind[j+1]-ind[j]-1)
answer = []
ans = 0
for j in range(len(var)):
if var[j]*b <= a:
ans += var[j]*b
else:
answer.append(ans+a)
ans = 0
if j==len(var)-1:
answer.append(ans+a)
if s.count("1")==0:
print(0)
elif len(answer)==0:
print(a)
else:
print(sum(answer))#include <bits/stdc++.h>
using namespace std;
int dp[100005],z[100005];
char c[10005];
int main()
{
int t;
cin>>t;
while(t--){
//TODO
int a,b;
memset(dp,0,sizeof(dp));
cin>>a>>b>>c;
int n=strlen(c);
if(c[0]=='1'){
//TODO
dp[0]=a;
}
for(int i=0; i<n; i++){
//TODO
if(c[i]=='0'){
//TODO
dp[i]=dp[i-1];
}
else{
int j;
for(j=i-1; j>=0; j--){
//TODO
if(c[j]=='1'){
//TODO
break;
}
}
if(j<0){
//TODO
dp[i]=a;
continue;
}
if(c[i-1]=='1'){
//TODO
dp[i]=dp[i-1];
continue;
}
dp[i]=min(dp[i-1]+a,dp[j]+(i-j-1)*b);
}
}
cout<<dp[n-1]<<endl;
}
return 0;
}
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |